A performance simulation tool for the analysis of data gathering in both terrestrial and underwater sensor networks

Wireless sensor networks (WSNs) have greatly contributed to human-associated technologies. The deployment of WSNs has transcended several paradigms. Two of the most significant features of WSNs are the intensity of deployment and the criticalness of the applications that they govern. The tradeoff between volume and cost requires justified investments for evaluating the multitudes of hardware and complementary software options. In underwater sensor networks (USNs), testing any technique is not only costly but also difficult in terms of full deployment. Therefore, evaluation prior to the actual procurement and setup of a WSN and USN is an extremely important step. The spectrum of performance analysis tools encompassing the test-bed, analysis, and simulation has been able to provide the prerequisites that these evaluations require. Simulations have proven to be an extensively used tool for analysis in the computer network field. A number of simulation tools have been developed for wired/wireless radio networks. However, each simulation tool has several restrictions when extended to the analysis of WSNs. These restrictions are largely attributed to the unique nature of each WSN within a designated area of research. In addition, these tools cannot be used for underwater environments with an acoustic communication medium, because there is a wide range of differences between radio and acoustic communications. The primary purpose of this paper is to present, propose, and develop a discrete event simulation designed specifically for mobile data gathering in WSNs. In addition, this simulator has the ability to simulate 2-D USNs. This simulator has been tailored to cater to both mobile and static data gathering techniques for both topologies, which are either dense or light. The results obtained using this simulator have shown an evolving efficient simulator for both WSNs and USNs. The developed simulator has been extensively tested in terms of its validity and scope of governance

Dialog chatbot as an interactive online tool in enhancing ESP vocabulary learning

Purpose – Based on an experimental study on English for Specific Purposes (ESP) students, at the Business Department at the University of Bisha, the purpose of the study is to examine the effect of chatbot use on learning ESP in online classrooms during COVID-19 and find out how Dialogflow chabot can be a useful and interactive online platform to help ESP learners in learning vocabulary well. Design/methodology/approach – The research paper is based on an experimental study of two groups, an experiential group and a controlled group. Two tests were carried out. Pre-tests and post-test of vocabulary knowledge were conducted for both groups to explore the usefulness of using the Dialogflow chatbot in learning ESP vocabulary. A designed chatbot content was prepared and included all the vocabulary details related to words' synonyms and a brief explanation of words’ meanings. An informal interview is another tool used in the study. The purpose of using the interview with the participants was to elicit more data from the participants about using the chatbot and about how and in what aspects chatbot using the conversational program was useful and productive. Findings – The findings of the study explored that the use of chatbots plays a major role in enhancing and learning ESP vocabulary. That was clear as the results showed that the students who used the chatbot Dialogflow in the experimental group outperformed their counterparts in the control group. Research limitations/implications – The study displays an important pedagogical implication as the use of chatbots could be applied in several settings to improve language learning in general or learning ESP courses in particular. Chatbot creates an interesting environment to foster build good interactions where negotiation of meaning takes place clearly seems to be of great benefit to help learners advance in their L2 lexical development. Originality/value – Examining and exploring whether the use of chatbots plays a major role in enhancing and learning ESP vocabulary in English as Foreign Language setting

An Adaptive Data Gathering Algorithm for Minimum Travel Route Planning in WSNs Based on Rendezvous Points

A recent trend in wireless sensor network (WSN) research is the deployment of a mobile element (ME) for transporting data from sensor nodes to the base station (BS). This helps to achieve significant energy savings as it minimizes the communications required among nodes. However, a major problem is the large data gathering latency. To address this issue, the ME (i.e., vehicle) should visit certain rendezvous points (i.e., nodes) to collect data before it returns to the BS to minimize the data gathering latency. In view of this, we propose a rendezvous-based approach where some certain nodes serve as rendezvous points (RPs). The RPs gather data using data compression techniques from nearby sources (i.e., affiliated nodes) and transfer them to a mobile element when the ME traverses their paths. This minimizes the number of nodes to be visited, thereby reducing data gathering latency. Furthermore, we propose a minimal constrained rendezvous point (MCRP) algorithm, which ensures the aggregated data are relayed to the RPs based on three constraints: (i) bounded relay hop, (ii) the number of affiliation nodes, and (iii) location of the RP. The algorithm is designed to consider the ME’s tour length and the shortest path tree (SPT) jointly. The effectiveness of the algorithm is validated through extensive simulations against four existing algorithms. Results show that the MCRP algorithm outperforms the compared schemes in terms of the ME’s tour length, data gathering latency, and the number of rendezvous nodes. MCRP exhibits a relatively close performance to other algorithms with respect to power algorithms

Mobile data gathering algorithms for wireless sensor networks

Data gathering is among the issues constantly acquiring attention in the area of Wireless Sensor Networks (WSNs) due to its impact and ability to transform many areas associated with the human life. There is a consistent increase in the research directed on the gains of applying mobile elements to collect data from sensors, especially those oriented to power issues as compared to multi-hop technique. There are two prevailing strategies used to collect data in sensor networks. The first approach requires data packets to be serviced via multi-hop relay to reach the respective Base Station (BS). The second strategy encompasses a mobile element which serves as the core element for the searching of data. These mobile elements will go to each transmission range of each respective sensor to upload its data. In this research, a Mobile Data Gathering based Network Layout (MDG-NL) algorithm is proposed. This algorithm enables shortened tour length for the respective mobile element. In addition, a certain number of nodes work as a temporary BS by aggregating the data packets from affiliated sensors via multi-hop. Furthermore, strategically divisioning the area of data collection, the optimization of the mobile element can be elevated. These derived areas are centric on determining the common configuration ranges strategically placing the collection point. Thus, within each of these areas, the multi-hop collection is deployed. This research presents a Zonal Data Gathering based Multi-hop and Mobile Element (ZDG-MME) algorithm to enhance the network lifetime. ZDG-MME algorithm is able to segment the deployment field into two divisions and forward the tailored data to the BS. First, the inner division which is the closest to the BS reports the sensed data directly through multi-hop. Second, the outer division reports the data to certain nodes selected as polling nodes. ZDG-MME algorithm is designed to ensure minimizing both the energy consumption and the data gathering latency whilst avoiding the hotspot area. The third proposed algorithm achieves an adaptive data gathering strategy. In this algorithm, the user has to tune an appropriate variable which directly affects the power consumption and the data gathering latency. This variable is a trade-off parameter that balances between the energy consumption and data gathering latency. The selection of this parameter is based on the application requirements. Minimal Constrained Rendezvous Node (MCRN) algorithm is designed to ensure that the number of pause locations for the mobile element is minimized. In MCRN, the selecting of rendezvous nodes is based on three factors: 1) bounded relay hop 2) number of affiliation nodes 3) distance of the respective rendezvous node to the BS. The algorithm is proven to minimize the number of rendezvous nodes which ensure that the tour length and the data gathering latency are both minimized. The performance evaluation of the proposed data gathering algorithms has been done through a detailed and extensive discrete-event-simulation analysis. The acquired results show that the MDG-NL scheme significantly improves the performance over SPT-DGA up to 12.5%. The results obtained by the ZDG-MME shows an enhancement on the performance up to 15.21%. The results have proven the enhancements achieved by the proposed algorithms through the performance metrics of tour length, data gathering latency and total energy consumed

An adaptive data gathering algorithm for minimum travel route planning in WSNs based on rendezvous points

A recent trend in wireless sensor network (WSN) research is the deployment of a mobile element (ME) for transporting data from sensor nodes to the base station (BS). This helps to achieve significant energy savings as it minimizes the communications required among nodes. However, a major problem is the large data gathering latency. To address this issue, the ME (i.e., vehicle) should visit certain rendezvous points (i.e., nodes) to collect data before it returns to the BS to minimize the data gathering latency. In view of this, we propose a rendezvous-based approach where some certain nodes serve as rendezvous points (RPs). The RPs gather data using data compression techniques from nearby sources (i.e., affiliated nodes) and transfer them to a mobile element when the ME traverses their paths. This minimizes the number of nodes to be visited, thereby reducing data gathering latency. Furthermore, we propose a minimal constrained rendezvous point (MCRP) algorithm, which ensures the aggregated data are relayed to the RPs based on three constraints: (i) bounded relay hop, (ii) the number of affiliation nodes, and (iii) location of the RP. The algorithm is designed to consider the ME’s tour length and the shortest path tree (SPT) jointly. The effectiveness of the algorithm is validated through extensive simulations against four existing algorithms. Results show that the MCRP algorithm outperforms the compared schemes in terms of the ME’s tour length, data gathering latency, and the number of rendezvous nodes. MCRP exhibits a relatively close performance to other algorithms with respect to power algorithms

An efficient group-based control signalling within proxy mobile IPv6 protocol

Providing a seamless handover in the Internet of Thing (IoT) applications with minimal efforts is a big challenge in mobility management protocols. Several research efforts have been attempted to maintain the connectivity of nodes while performing mobility-related signalling, in order to enhance the system performance. However, these studies still fall short at the presence of short-term continuous movements of mobile nodes within the same network, which is a requirement in several applications. In this paper, we propose an efficient group-based handoff scheme for the Mobile Nodes (MNs) in order to reduce the nodes handover during their roaming. This scheme is named Enhanced Cluster Sensor Proxy Mobile IPv6 (E-CSPMIPv6). E-CSPMIPv6 introduces a fast handover scheme by implementing two mechanisms. In the first mechanism, we cluster mobile nodes that are moving as a group in order to register them at a prior time of their actual handoff. In the second mechanism, we manipulate the mobility-related signalling of the MNs triggering their handover signalling simultaneously. The efficiency of the proposed scheme is validated through extensive simulation experiments and numerical analyses in comparison to the state-of-the-art mobility management protocols under different scenarios and operation conditions. The results demonstrate that the E-CSPMIPv6 scheme significantly improves the overall system performance, by reducing handover delay, signalling cost and end-to-end delay

Antiproliferative activity of moringa oleifera's leaves ethanolic extract and docetaxel on lncap cell line and on the level of tumor necrosis factor-related apoptosis-inducing ligand

Background: Cancer is abnormal cells growth that is responsible for the majority of global deaths and cancer is expected to rank as leading cause of death and the single most important barrier to increasing life expectancy in every country of the world in the 21st century. According to the estimates from the world health organization in 2015, cancer is the first or second leading cause of death before age 70 years in 91 of 172 countries, and it ranks third or fourth in an additional 22 countries. Many anti-cancer drugs in current use such as paclitaxel, vincristine, and vinblastine are naturally derived agents. The aim of this study is to determine the effects of ethanolic leaves extract of Moringa oleifera and docetaxel each separately and in combinations on the proliferation of LNCaP cell line, and on the level of tumor necrosis factor related apoptosis induced ligand (TRAIL). Methods: This work was performed in the laboratory of cancer research at college of medicine\ university of Babylon during the period from January 2021 to October 2021. The study was approved by the ethics committee in the college of medicine at university of Babylon

Predetermined path of mobile data gathering in wireless sensor networks based on network layout

Data gathering is among the issues constantly acquiring attention in the area of wireless sensor networks (WSNs). There is a consistent increase in the research directed on the gains of applying mobile elements (MEs) to collect data from sensors, especially those oriented to power issues. There are two prevailing strategies used to collect data in sensor networks. The first approach requires data packets to be serviced via multi-hop relay to reach the respective base station (BS). Thus, sensors will send their packets through other intermediate sensors. However, this strategy has proven to consume high and a substantial amount of energy due to the dependency on other nodes for transmission. The second approach encompasses a ME which serves as the core element for the searching of data. This ME will visit the transmission range of each sensor to upload its data before eventually returning to the BS to complete the data transmission. This approach has proven to reduce the energy consumption substantially as compared to the multi-hop strategy. However, it has a trade-off which is the increase of delay incurred and is constrained by the speed of ME. Furthermore, some sensors may lose their data due to overflow while waiting for the ME. In this paper, it is proposed that by strategically divisioning the area of data collection, the optimization of the ME can be elevated. These derived area divisions are focused on the determination of a common configuration range and the correlation with a redundant area within an identified area. Thus, within each of these divided areas, the multi-hop collection is deployed as a sub-set to the main collection. The ME will select a centroid point between two sub-polling points, subsequently selecting common turning points as the core of the basis of the tour path. Extensive discrete-event simulations have been developed to assess the performance of the proposed algorithm. The acquired results depicted through the performance metrics of tour length and latency have determined the superior performance of the proposed algorithm in comparison to the existing strategy. In addition, the proposed algorithm maintains the energy consumption within an acceptable level

Static and mobile data gathering techniques in Wireless Sensor Networks: a survey

Wireless Sensor Networks (WSNs) have continued tremendous by towards the change of human civilization from different perspectives which emerged as an effective solution for many applications. WSN consists of hundreds of tiny sensors which deployed in specific area for a specific purpose, while the data is the precious value stand behind the needs for WSN that play a significant role in human life. Communication between nodes in the deployment area is a must to send data from all sensors to reach the base station and then to the end user. One fundamental factor that affects energy dissipation for each sensor is determined based on the communication techniques used to collect and deliver the data which has a direct impact on the lifetime of the whole network. In this paper, we present a taxonomy of data gathering algorithms in WSNs for the static-based and mobile-based architectures. In addition, we present an overview of each technique, and highlighted the features and drawbacks of each one. An extensive survey was provided including the variety of existed data gathering technique